A One Line Factoring Algorithm
نویسندگان
چکیده
We describe a variant of Fermat’s factoring algorithm which is competitive with SQUFOF in practice but has heuristic run time complexity O(n1/3) as a general factoring algorithm. We also describe a sparse class of integers for which the algorithm is particularly effective. We provide speed comparisons between an optimised implementation of the algorithm described and the tuned assortment of factoring algorithms in the Pari/GP computer algebra package. 2010 Mathematics subject classification: primary 11A51.
منابع مشابه
Lower Bounds for Straight Line Factoring
Straight line factoring algorithms include a variant Lenstra’s elliptic curve method. This note proves lower bounds on the length of straight line factoring algorithms.
متن کاملDe Factorisatione Numerorum I : In Pursuit of the Erymanthian Boar
Abstract. We introduce a new deterministic factoring algorithm, which could be described in the fashionable term of “factoring with hints”: we show that, given the knowledge of the factorisations of O(N) terms following N = pq product of two large primes, we can recover deterministically p and q in O(N) bit operations. Although this is slower than the current best factoring algorithms, this met...
متن کاملA parallel line sieve for the GNFS Algorithm
RSA is one of the most important public key cryptosystems for information security. The security of RSA depends on Integer factorization problem, it relies on the difficulty of factoring large integers. Much research has gone into problem of factoring a large number. Due to advances in factoring algorithms and advances in computing hardware the size of the number that can be factorized increase...
متن کاملGNFS Factoring Statistics of RSA-100, 110, ..., 150
GNFS (general number field sieve) algorithm is currently the fastest known algorithm for factoring large integers. Up to the present, several running time estimates for GNFS are announced (ex. [LV00]). These estimates are usually based on the previous factoring results. However, since the previous factoring results were done by various programs and/or computers, it is difficult to compare those...
متن کاملFactoring Boolean functions using graph partitioning
Factoring Boolean functions is one of the basic operations in algorithmic logic synthesis. Current algorithms for factoring Boolean functions are based on some kind of division (Boolean or algebraic). In this paper, we present an algorithm for factoring that uses graph partitioning rather than division. Our algorithm is recursive and operates on the function and on its dual, to obtain the bette...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012